Experiments with automata compressionDACIUK, Jan.Lecture notes in computer science. 2001, pp 105-112, issn 0302-9743, isbn 3-540-42491-1Conference Paper

Common subsequence automatonTRONICEK, Zdenek.Lecture notes in computer science. 2003, pp 270-275, issn 0302-9743, isbn 3-540-40391-4, 6 p.Conference Paper

CONTRIBUTION À L'ALGORITHMIQUE DES AUTOMATES : COMPLEXITÉ ET ASPECTS TOPOLOGIQUES = CONTRIBUTION TO THE ALGORITHMIC OF AUTOMATA : COMPLEXITY AND TOPOLOGCAL ASPECTSHeam, Pierre-Cyrille; Weil, Pascal.2001, 212 p.Thesis

An algorithm for identifying spliced languagesKIM, S. M.Lecture notes in computer science. 1997, pp 403-411, issn 0302-9743, isbn 3-540-63357-XConference Paper

The parameterized complexity of intersection and composition operations on sets of finite-state automataWAREHAM, H. Todd.Lecture notes in computer science. 2001, pp 302-310, issn 0302-9743, isbn 3-540-42491-1Conference Paper

Unary language concatenation and its state complexityPIGHIZZINI, Giovanni.Lecture notes in computer science. 2001, pp 252-262, issn 0302-9743, isbn 3-540-42491-1Conference Paper

Cayley automata = Automates de CayleyGARZON, M.Theoretical computer science. 1993, Vol 108, Num 1, pp 83-102, issn 0304-3975Conference Paper

Improvements on printing mice in labyrinthsMÜLLER, H.Computing (Wien. Print). 1992, Vol 47, Num 3-4, pp 235-246, issn 0010-485XArticle

On the construction of reversible automata for reversible languagesLOMBARDY, Sylvain.Lecture notes in computer science. 2002, pp 170-182, issn 0302-9743, isbn 3-540-43864-5, 13 p.Conference Paper

Lessons from INR in the specification of transductionsJOHNSON, J. Howard.Lecture notes in computer science. 2001, pp 335-336, issn 0302-9743, isbn 3-540-42491-1Conference Paper

ARITHMETIQUE EN LIGNE EN BASE REELLE ET COMPLEXE = ON-LINE ARITHMETICS IN REAL AND COMPLEX BASESSurarerks, Athasit; Frougny, Christiane.2001, 141 p.Thesis

Quantum reversibility and a new model of quantum automatonCIAMARRA, Massimo Pica.Lecture notes in computer science. 2001, pp 376-379, issn 0302-9743, isbn 3-540-42487-3Conference Paper

Automata on infinite trees with counting constraintsBEAUQUIER, D; NIWINSKI, D.Information and computation (Print). 1995, Vol 120, Num 1, pp 117-125, issn 0890-5401Article

Subshifts behavior of cellular automata. Topological properties and related languagesCATTANEO, Gianpiero; DENNUNZIO, Alberto.Lecture notes in computer science. 2005, pp 140-152, issn 0302-9743, isbn 3-540-25261-4, 13 p.Conference Paper

Unambiguous automata on bi-infinite wordsCARTON, Olivier.Lecture notes in computer science. 2003, pp 308-317, issn 0302-9743, isbn 3-540-40671-9, 10 p.Conference Paper

Ambainis-Freivalds' algorithm for measure-once automataBERZINA, Aija; BONNER, Richard.Lecture notes in computer science. 2001, pp 83-93, issn 0302-9743, isbn 3-540-42487-3Conference Paper

Representation of autonomous automataBULS, Janis; BUZA, Vaira; GLAUDINS, Roberts et al.Lecture notes in computer science. 2001, pp 372-375, issn 0302-9743, isbn 3-540-42487-3Conference Paper

Représentation des nombres complexes et automates finis = Radix representation of complex numbers and finite automataSafer, Taoufik; Frougny, Christiane.1997, 105 p.Thesis

FIRE Lite : FAs and REs in C++WATSON, B. W.Lecture notes in computer science. 1997, pp 167-188, issn 0302-9743, isbn 3-540-63174-7Conference Paper

Programs with quasi-stable channels are effectively recognizableCECE, G; FINKEL, A.Lecture notes in computer science. 1997, pp 304-315, issn 0302-9743, isbn 3-540-63166-6Conference Paper

Utilisation d'automates pour la prévision = Utilization of automata for forecastingBONE, R; DAGUIN, C; GEORGEVAIL, A et al.ACSEG. Rencontre internationale. 1996, pp 159-164, isbn 2-86939-108-0Conference Paper

Path-equivalent removals of ε-transitions in a genomic weighted finite automatonGIRAUD, Mathieu; VEBER, Philippe; LAVENIER, Dominique et al.Lecture notes in computer science. 2006, pp 23-33, issn 0302-9743, isbn 3-540-37213-X, 1Vol, 11 p.Conference Paper

Automatic MusicJOHNSON, T.Publications du LMA (Marseille). 1998, issn 1159-0947, isbn 2-909669-12-2, 5 p.Conference Paper

Les automates finis = Finite-state automataCROCHEMORE, M; PERRIN, D; PIN, J.-E et al.Le Courrier du C.N.R.S. 1993, Num 80, pp 48-51, issn 0153-985XArticle

Finding common motifs with gaps using finite automataANTONIOU, Pavlos; HOLUB, Jan; ILIOPOULOS, Costas S et al.Lecture notes in computer science. 2006, pp 69-77, issn 0302-9743, isbn 3-540-37213-X, 1Vol, 9 p.Conference Paper